Parallel Implementations of the Fast Sweeping Method
نویسندگان
چکیده
The fast sweeping method is an efficient iterative method for hyperbolic problems. It combines Gauss-Seidel iterations with alternating sweeping orderings. In this paper several parallel implementations of the fast sweeping method are presented. These parallel algorithms are simple and efficient due to the causality of the underlying partial different equations. Numerical examples are used to verify our algorithms. Mathematics subject classification: 65N06, 65N12, 65N55.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملMicrosoft Word - 06_02_11.docx
We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and the Fast Iterative Method to determine a numerical solution to the eikonal equation. We point out how the Fast Iterative Method outperforms the other two thanks to its parallel processing capabilities.
متن کاملA Fast Sweeping Method for Static Convex Hamilton-Jacobi Equations
We develop a fast sweeping method for static Hamilton-Jacobi equations with convex Hamiltonians. Local solvers and fast sweeping strategies apply to structured and unstructured meshes. With causality correctly enforced during sweepings numerical evidence indicates that the fast sweeping method converges in a finite number of iterations independent of mesh size. Numerical examples validate both ...
متن کاملM ay 2 00 8 Fast Parallel Frequency Sweeping Algorithms for Robust D - Stability Margin ∗
This paper considers the robust D-stability margin problem under polynomic structured real parametric uncertainty. Based on the work of De Gaston and Safonov (1988), we have developed techniques such as, a parallel frequency sweeping strategy, different domain splitting schemes, which significantly reduce the computational complexity and guarantee the convergence.
متن کاملFast Sweeping Fifth Order WENO Scheme for Static Hamilton-Jacobi Equations with Accurate Boundary Treatment
A fifth order weighted essentially non-oscillatory (WENO) fast sweeping method is designed in this paper, extending the result of the third order WENO fast sweeping method in J. Sci. Comput. 29, 25–56 (2006) and utilizing the two approaches of accurate inflow boundary condition treatment in J. Comput. Math. 26, 1–11 (2008), which allows the usage of Cartesian meshes regardless of the domain bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007